Dynamic Grid Embedding with Few Bends and Changes

In orthogonal graph drawing, edges are represented by sequences of horizontal and vertical straight line segments. For graphs of degree at most four, this can be achieved by embedding the graph in a grid. The number of bends displayed is an important criterion for layout quality. A well-known algorithm of Tamassia eeciently embeds a planar graph with xed combinatorial embedding and vertex degree at most four in the grid such that the number of bends is minimum Tam87]. When given a dynamic graph, i.e. a graph that changes over time, one has to take into account not only the static criteria of layout quality, but also the eeort users spent to regain familiarity with the layout. Therefore, consecutive layouts should compromize between quality and change. We here extend Tamassia's layout model to dynamic graphs in a way that allows to specify the relative importance of the number of bends vs. the number of changes between consecutive layouts. We also show that optimal layouts in the dynamic model can be computed eeciently by means that are very similar to the static model, namely by solving a minimum cost ow problem in a suitably deened network.